package com.atguigu.algorithm.prim;

/**
 * 普利姆算法-图的构造
 *
 * @author: xr-8
 * @date: 2023-01-16 20:33
 */
public class MGraph {
    int vertexes; //表示图的节点个数
    char[] data;//存放结点数据
    int[][] weight; //存放边，就是我们的邻接矩阵

    public MGraph(int vertexes) {
        this.vertexes = vertexes;
        data = new char[vertexes];
        weight = new int[vertexes][vertexes];
    }
}